Non-intrusive polynomial chaos expansion for topology optimization using polygonal meshes
نویسندگان
چکیده
منابع مشابه
Uncertainty Analysis for Parametric Roll Using Non-intrusive Polynomial Chaos
In this paper, uncertainty analysis is carried out on both a simple parametric roll model which can be modeled as a Mathieu equation and a 1.5 degree-of-freedom parametric roll model in regular seas. For both cases, the uncertainty is brought into the system due to the error in predicting the damping coefficients. The non-intrusive polynomial chaos method has been used to assess how the paramet...
متن کاملVem and Topology Optimization on Polygonal Meshes
Topology optimization is a fertile area of research that is mainly concerned with the automatic generation of optimal layouts to solve design problems in Engineering. The classical formulation addresses the problem of finding the best distribution of an isotropic material that minimizes the work of the external loads at equilibrium, while respecting a constraint on the assigned amount of volume...
متن کاملNonlinear Propagation of Orbit Uncertainty Using Non-Intrusive Polynomial Chaos
This paper demonstrates the use of polynomial chaos expansions (PCEs) for the nonlinear, non-Gaussian propagation of orbit state uncertainty. Using linear expansions in tensor-products of univariate orthogonal polynomial bases, PCEs approximate the stochastic solution of the ordinary differential equation describing the propagated orbit, and include information on covariance, higher moments, an...
متن کاملEfficient Shape Optimization Using Polynomial Chaos Expansion and Local Sensitivities
This paper presents an efficient shape optimization technique based on stochastic response surfaces (polynomial chaos expansion) constructed using performance and local sensitivity data at heuristically selected collocation points. The cited expansion uses Hermite polynomial bases for the space of square-integrable probability density functions and provides a closed form solution of the perform...
متن کاملCarving for topology simplification of polygonal meshes
The topological complexity of polygonal meshes has a large impact on the performance of various geometric processing algorithms, such as rendering and collision detection algorithms. Several approaches for simplifying topology have been discussed in the literature. These methods operate locally on models, which makes their effect on the topology hard to predict and analyze. Most existing method...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Brazilian Society of Mechanical Sciences and Engineering
سال: 2018
ISSN: 1678-5878,1806-3691
DOI: 10.1007/s40430-018-1464-2